String Scanning in the Icon Programming Language

In-Depth Coverage of the Icon Programming Language String Synthesis

Our solution is given below. First we need procedures analogous to the procedure used for modeling string scanning. In addition to a subject, there’s now an “object”, which is the result of string synthesis. There now also are two positions, one in the subject and one in the object. The global identifiers subject, object, s_pos, and o_pos are used for these four “state variables” in the procedu...

Type Inference in the Icon Programming Language

Data Structures in the Icon Programming Language

The lcon programming language provides a rich variety of data structures with sophisticated facilities: sets of arbitrary values, tables with associative lookup, lists with positional and deque access mechanisms, and records that extend the type repertoire ofthe language. Instances ofthese structures are created at run-time and grow and shrink as values are added to or removed from them. Storag...

Workshop on the Icon Programming Language

A workshop related to the Icon programming language took place at Northern Arizona University (NAU) in Flagstaff, Arizona on July 26-29, 1988. Steve Wampler, who initially suggested a meeting on Icon, and who organized the workshop, served as host. Twenty-eight persons were invited to participate, including the Icon Project group at The University of Arizona and others closely associated with I...

In - Depth Coverage of the Icon Programming Language The Icon Analyst

Early artificial intelligence programming languages that incorporated search and backtracking facilities did not limit backtracking to previous computations when a portion of a search failed [1]. This had two unpleasant consequences: (1) the amount of data that had to be retained to allow backtracking limited the problems that could be handled, and (2) unexpected failure could cause backtrackin...